package com.sicheng.蓝桥.练习题;

import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.PriorityQueue;

/**
 * @author zsc
 * @version 1.0
 * @date 2022/1/8 23:25
 * https://blog.csdn.net/wei242425445/article/details/93330427?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164165437416780271938182%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=164165437416780271938182&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_positive~default-1-93330427.first_rank_v2_pc_rank_v29&utm_term=%E8%BF%AA%E6%9D%B0%E6%96%AF%E7%89%B9%E6%8B%89%E7%AE%97%E6%B3%95&spm=1018.2226.3001.4187
 */
public class 迪杰斯特拉 {
    public static void main(String[] args) {
        PriorityQueue<Integer> queue = new PriorityQueue<>(Comparator.reverseOrder());
        queue.addAll(Arrays.asList(2, 2, 14, 4, 16, 6, 5, 3));

        queue.poll();
        queue.forEach(System.out::println);
        queue.remove(4);

        HashMap<String, String> hashMap = new HashMap<>();
        hashMap.put("hello", "world");

        System.out.println(5 >> 3);//结果是0
        System.out.println(-5 >> 3);//结果是-1
        System.out.println(-5 >>> 3);//结果是536870911


    }

}
